The scale-based pyramid weighting of the wavelet coefficients in zerotree coding techniques

نویسندگان

  • Laurentiu Grigoriu
  • Radu Zaciu
چکیده

The efficiency of all Zerotree coding algorithms relay on the "decaying spectrum" hypothesis: a wavelet coefficient within a certain frequency scale of a wavelet subband decomposition has a larger magnitude than all his descendants (coefficients situated in higher frequency scales having the same spatial orientation). The higher the percentage this hypothesis is satisfied, the better are the results delivered by the Zerotree algorithms (in terms of PSNR and bitrate). The paper proposes a technique enforcing this hypothesis to be satisfied: scale-based pyramid weighting of the wavelet coefficients. Each scale of coefficients will be amplified with respect of the next higher frequency scale so that lower frequency scales (from the top of the wavelet decomposition pyramid) will have a higher amplification than lower frequency scales (from the base of the pyramid). There are also presented two equivalent techniques: scale-based reverse-pyramid weighting of the thresholds, and the use of supra-unitary norm wavelet filters in subband decomposition step.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining wavelet and fractal coding for 3-D video coding

Smooth regions and edges are very self similar and can be coded efficiently by fractal coders. One problem of fractal image coding is to achieve a high quality or a lossless representation of an image. This can be overcome by a hybrid coding approach as proposed by the authors in [3]. An extension to 3-D fractal video coding is described in [4]. Due to the block based algorithm, however, blocki...

متن کامل

On Zerotree Quantization for Embedded Wavelet Packet Image Coding

Wavelet packets are an effective representation tool for adaptive waveform analysis of a given signal. We first combine the wavelet packet representation with zerotree quantization for image coding. A general zerotree structure is defined which can adapt itself to any arbitrary wavelet packet basis. We then describe an efficient coding algorithm based on this structure. Finally, the hypothesis ...

متن کامل

Zerotree Wavelet Coding Using Fractal Prediction

Fractal image coding can be seen as spectral prediction of coefficients in the wavelet decomposition of an image. Fine scale coefficients are described by shifted and scaled coefficients from the next coarser frequency scale. We analyzed the ability of fractal coders to predict wavelet coefficients and found that the prediction of entire wavelet subtrees-as done by conventional spatial domain f...

متن کامل

Adaptive vector quantization for efficient zerotree-based coding of video with nonstationary statistics

A new system for intraframe coding of video is described. This system combines zerotrees of vectors of wavelet coefficients and the generalized-threshold-replenishment (GTR) technique for adaptive vector quantization (AVQ). A data structure, the vector zerotree (VZT), is introduced to identify trees of insignificant vectors, i.e., those vectors of wavelet coefficients in a dyadic subband decomp...

متن کامل

Flexible Zerotree Coding of Wavelet Coefficients

We introduce an extended EZW coder that uses flexible zerotree coding of wavelet coefficients. A flexible parentchild relationship is defined so as to exploit spatial dependencies within a subband as well as hierarchical dependencies among multi-scale subbands. The new relationship is based on a particular statistics that a large coefficient is more likely to have large coefficients in its neig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003